-
1 positive propositional tautology
Математика: позитивная пропозициональная тавтологияУниверсальный англо-русский словарь > positive propositional tautology
-
2 positive propositional tautology
English-Russian scientific dictionary > positive propositional tautology
-
3 propositional
пропозициональный alphabet of propositional calculus ≈ алфавит исчисления высказываний, алфавит нулевого порядка classical propositional calculus ≈ классическое исчисление высказываний, классическое пропозициональное исчисление classical propositional logic ≈ классическая логика высказываний constructive propositional calculus ≈ конструктивное исчисление высказываний, конструктивное пропозициональное исчисление extended propositional calculus ≈ расширенное исчисление высказываний, расширенное пропозициональное исчисление intuitionistic propositional tautology ≈ интуиционистская пропозициональная тавтология minimal propositional calculus ≈ минимальное исчисление высказываний, минимальное пропозициональное исчисление modal propositional calculus ≈ модальное исчисление высказываний, модальное пропозициональное исчисление multivalued propositional calculus ≈ многозначное исчисление высказываний, многозначное пропозициональное исчисление open propositional function ≈ открытая пропозициональная функция partial propositional calculus ≈ частное исчисление высказываний, частное пропозициональное исчисление positive propositional calculus ≈ позитивное исчисление высказываний, позитивное пропозициональное исчисление positive propositional tautology ≈ позитивная пропозициональная тавтология primitive propositional constant ≈ исходная пропозициональная постоянная proper propositional calculus ≈ собственное исчисление высказываний, собственное пропозициональное исчисление two-valued propositional calculus ≈ двузначное [классическое] исчисление высказываний, двузначное [классическое] пропозициональное исчисление unary propositional connective ≈ унарная пропозициональная связка - propositional algebra - propositional argument - propositional axiom - propositional calculus - propositional connective - propositional form - propositional formula - propositional function - propositional functor - propositional hierarchy - propositional implication - propositional inference - propositional interpretation - propositional letter - propositional logic - propositional operator - propositional tautology - propositional variable ПропозициональноБольшой англо-русский и русско-английский словарь > propositional
-
4 tautology
См. также в других словарях:
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia
Stable model semantics — The concept of a stable model, or answer set, is used to define a declarative semantics for logic programs with negation as failure. This is one of several standard approaches to the meaning of negation in logic programming, along with program… … Wikipedia
metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… … Universalium
Logical positivism — (also known as logical empiricism, scientific philosophy, and neo positivism) is a philosophy that combines empiricism the idea that observational evidence is indispensable for knowledge with a version of rationalism incorporating mathematical… … Wikipedia
Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… … Wikipedia
Laws of Form — (hereinafter LoF ) is a book by G. Spencer Brown, published in 1969, that straddles the boundary between mathematics and of philosophy. LoF describes three distinct logical systems: * The primary arithmetic (described in Chapter 4), whose models… … Wikipedia
Logic gate — A logic gate is an idealized or physical device implementing a Boolean function, that is, it performs a logical operation on one or more logic inputs and produces a single logic output. Depending on the context, the term may refer to an ideal… … Wikipedia
Boolean algebra (structure) — For an introduction to the subject, see Boolean algebra#Boolean algebras. For the elementary syntax and axiomatics of the subject, see Boolean algebra (logic). For an alternative presentation, see Boolean algebras canonically defined. In abstract … Wikipedia
Negation — For other uses, see Negation (disambiguation). In logic and mathematics, negation, also called logical complement, is an operation on propositions, truth values, or semantic values more generally. Intuitively, the negation of a proposition is… … Wikipedia
epistemology — epistemological /i pis teuh meuh loj i keuhl/, adj. epistemologically, adv. epistemologist, n. /i pis teuh mol euh jee/, n. a branch of philosophy that investigates the origin, nature, methods, and limits of human knowledge. [1855 60; < Gk… … Universalium
